Space-Efficient Range-Sum Queries in OLAP
نویسندگان
چکیده
In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time update and using minimum space. Furthermore, we study the trade-off between query time and update time. The complexity for query is O(2) and for updates O((2 2 l √ n)) on a data cube of n elements, where l is a trade-off parameter. Our algorithm improve over previous best known results.
منابع مشابه
Efficient Updates for OLAP Range Queries on Flash Memory
This paper explores efficient ways to use flash memory to store OLAP data. The particular type of queries considered are range queries using the aggregate functions SUM, COUNT and AVG. The asymmetric cost of reads and writes for flash memory gives higher importance to how updates are handled in a flash memory environment. A popular data structure used for answering OLAP rangesum queries is the ...
متن کاملEfficient evaluation of partially-dimensional range queries in large OLAP datasets
In light of the increasing requirement for processing multidimensional queries on OLAP (relational) data, the database community has focused on the queries (especially range queries) on the large OLAP datasets from the view of multidimensional data. It is well-known that multidimensional indices are helpful to improve the performance of such queries. However, we found that much information irre...
متن کاملRange Sum Queries in Dynamic OLAP Data Cubes
The data cube is frequently adopted to implement On-Line Analytical Processing (OLAP) and provides aggregate information to support the analysis of contents of databases and data warehouses. Range-sum queries require accessing large data cubes and adding the contents of massive cells immediately. Techniques have thus been proposed to accelerate range-sum queries by applying pre-aggregated speci...
متن کاملRelative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or "near-current." Existing techniques for range sum ...
متن کاملK 2-Treaps: Range Top-k Queries in Compact Space
Efficient processing of top-k queries on multidimensional grids is a common requirement in information retrieval and data mining, for example in OLAP cubes. We introduce a data structure, the K-treap, that represents grids in compact form and supports efficient prioritized range queries. We compare the K-treap with state-of-the-art solutions on synthetic and real-world datasets, showing that it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004